Sorting, Selection and Routing on the Array with Reconngurable Optical Buses

نویسنده

S. Rajasekaran

چکیده

In this paper we present eecient algorithms for sorting, selection and packet routing on the AROB (Array with Reconngurable Optical Buses) model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mesh Connected Computers with Fixed and Reconngurable Buses: Packet Routing, Sorting, and Selection

Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with xed buses, and 2) a mesh with reconngurable buses. Both these models have been the subject matter of extensive previous research. We solve numerous important problems related to packet routing, sorting, and selec...

متن کامل

Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses

In this paper we present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconngurable optical buses. The main objective is to identify the mechanisms speciic to this type of architectures that allow us to build eecient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on the PRAM simulation complexi...

متن کامل

Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

In this paper, we present efficient algorithms for sorting, selection, and packet routing on the AROB (Array with Reconfigurable Optical Buses) model. One of our sorting algorithms sorts n general keys in O(1) time on an AROB of size n ¥ n for any constant > 0. We also show that selection from out of n elements can be done in randomized O(1) time employing n processors. Our routing algorithm ca...

متن کامل

Permutation Routing and Sorting on Meshes with Row and Column Buses

We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...

متن کامل